منابع مشابه
Computing simple paths among obstacles
Given a set X of points in the plane, two distinguished points s; t 2 X, and a set of obstacles represented by line segments, we wish to compute a simple polygonal path from s to t that uses only points in X as vertices and avoids the obstacles in. We present two results: (1) We show that nding such simple paths among arbitrary obstacles is NP-complete. (2) We give a polynomial-time algorithm t...
متن کاملComputing L1 Shortest Paths among Polygonal Obstacles in the Plane
Given a point s and a set of h pairwise disjoint polygonal obstacles of totally n vertices in the plane, we present a new algorithm for building an L1 shortest path map of size O(n) in O(T ) time and O(n) space such that for any query point t, the length of the L1 shortest obstacleavoiding path from s to t can be reported in O(log n) time and the actual shortest path can be found in additional ...
متن کاملRectilinear Paths among Rectilinear Obstacles
Given a set of obstacles and two distinguished points in the plane the problem of nding a collision free path subject to a certain optimization function is a fundamental problem that arises in many elds, such as motion planning in robotics, wire routing in VLSI and logistics in operations research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinea...
متن کاملBicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane
Given a rectilinear domain P of h pairwise-disjoint rectilinear obstacles with a total of n vertices in the plane, we study the problem of computing bicriteria rectilinear shortest paths between two points s and t in P. Three types of bicriteria rectilinear paths are considered: minimum-link shortest paths, shortest minimum-link paths, and minimum-cost paths where the cost of a path is a non-de...
متن کاملAn efficient direct approach for computing shortest rectilinear paths among obstacles in a two-layer interconnection model
In this paper, we present a direct approach for routing a shortest rectilinear path between two points among a set of rectilinear obstacles in a two-layer interconnec-tion model. The previously best known direct approach for this problem takes O(n log 2 n) time and O(n log n) space. By using integer data structures and an implicit graph representation scheme, we reduce the time bound to O(n log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2000
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(00)00011-0